Architecture of a Reconfigurable Processor for Implementing Search Algorithm over Discrete Matrices
نویسندگان
چکیده
The paper suggests architecture of a reconfigurable processor, which can be customized for implementing different search algorithms over discrete matrices. Such algorithms might be used for solving various problems of combinatorial optimization, such as covering, Boolean satisfiability, etc. The proposed architecture contains memory blocks for a binary or a ternary matrix, general-purpose registers, five stacks, that make possible to carry out recursive search procedures based on a decision tree, and a reprogrammable functional unit that allows to perform the required operations over binary and ternary vectors. Two levels of control circuits have been suggested. The first (top) level permits to realize the search algorithm. The second (bottom) level allows operations that are required for the algorithm to be implemented.
منابع مشابه
Architecture of Reconfigurable Processor for Implementing Search Algorithms over Discrete Matrices
The paper suggests architecture of a reconfigurable processor, which can be customized for implementing different search algorithms over discrete matrices. Such algorithms might be used for solving various problems of combinatorial optimization, such as covering, Boolean satisfiability, etc. The proposed architecture contains memory blocks for binary or ternary matrix, general-purpose registers...
متن کاملOn The Design of High Perfprmance Reconfigurable DSP processor using FPGA
In this paper, a high performance reconfigurable combined architecture of Discrete Wavelet Transform (DWT), Matrix Multiplication and Fast Fourier Transform is presented. This reduces area and become cost-effective. In the proposed DWT architecture the input data are separated as even and odd numbers of data as well as both data are inputted parallel. This cause faster DWT operation then conven...
متن کاملDesign and Implementation of Reconfigurable Processor for Problems of Combinatorial Computations
The paper analyses different techniques that might be employed in order to solve various problems of combinatorial optimization and argues that the best results can be achieved by the use of software, running on a general-purpose computer, together with an FPGAbased reconfigurable co-processor. It suggests architecture of combinatorial co-processor, which is based on hardware templates and cons...
متن کاملImplementation of VlSI Based Image Compression Approach on Reconfigurable Computing System - A Survey
Image data require huge amounts of disk space and large bandwidths for transmission. Hence, imagecompression is necessary to reduce the amount of data required to represent a digital image. Thereforean efficient technique for image compression is highly pushed to demand. Although, lots of compressiontechniques are available, but the technique which is faster, memory efficient and simple, surely...
متن کاملApplication Specific Computers for Combinatorial Optimisation
Solving large combinatorial optimisation problems is often time consuming, and thus there is interest in accelerating current algorithms by building application specific computers. This paper focuses on accelerating general local search meta-heuristics, such as simulated annealing and tabu search, and presents an architecture for this class of algorithms. As a design case study we describe a sp...
متن کامل